Immunity and simplicity in relativizations of probabilistic complexity classes
نویسندگان
چکیده
منابع مشابه
Immunity and Simplicity in Relativizations of Probabilistic Complexity Classes
The existence of immune and simple sets in relativizations of the probabilistic polynomial time bounded classes is studied. Some techniques previously used to show similar results for relativizations of P and NP are adapted to the probabilistic classes. Using these results, an exhaustive settling of ail possible strong séparations among these relativized classes is obtained. Résumé. -On étudie ...
متن کاملSimplicity, Immunity, Relativizations and Nondeterminism
The relation between classes of languages recognized by resource bounded Turing machines remains an evasive subject in computational complexity theory. Especially results settling relationship between deterministic and nondeterministic complexity classes are rare. The interesting case of the relation between the classes of languages recognized by polynomial time bounded deterministic versus pol...
متن کاملthe impact of attending efl classes on the level of depression of iranian female learners and their attributional complexity
می توان گفت واقعیت چند لایه ا ی کلاس های زبان انگلیسی بسیار حائز اهمیت است، زیرا عواطف و بینش های زبان آموزان تحت تاثیر قرار می گیرد. در پژوهش پیش رو، گفته می شود که دبیران با در پیش گرفتن رویکرد فرا-انسانگرایی ، قادرند در زندگی دانش آموزانشان نقش مهمی را ایفا سازند. بر اساس گفته ی ویلیامز و بردن (2000)، برای کرل راجرز، یکی از بنیان گذاران رویکرد انسانگرایی ، یادگیری بر مبنای تجربه، نوعی از یاد...
Probabilistic Algorithms and Complexity Classes
The main theme in this dissertation is a computation on a probabilistic Turing machine (PTM), which is a Turing machine with distinguished states called coin-tossing states. In general, it is assumed that a PTM has a fair coin. This is led by that any xed biased coin can simulate another xed biased coin in a constant expected time. We rst consider the computation which will always terminates in...
متن کاملImmunity and simplicity for exact counting and other counting classes
Ko [Ko90] and Bruschi [Bru92] independently showed that, in some relativized world, PSPACE (in fact, ⊕P) contains a set that is immune to the polynomial hierarchy (PH). In this paper, we study and settle the question of (relativized) separations with immunity for PH and the counting classes PP, C=P, and ⊕P in all possible pairwise combinations. Our main result is that there is an oracle A relat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 1988
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/1988220202271